A Message-Passing Approach to Decentralized Parallel Machine Scheduling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Message-Passing Approach to Decentralized Parallel Machine Scheduling

This paper tackles the problem of parallelizing heterogeneous computational tasks across a number of computational nodes (aka agents) where each agent may not be able to perform all the tasks and may have different computational speeds. An equivalent problem can be found in operations research, and it is known as scheduling tasks on unrelated parallel machines (also known as R‖Cmax). Given this...

متن کامل

Dynamic Load Balancing in a Message Passing Virtual Parallel Machine Dynamic Load Balancing in a Message Passing Virtual Parallel Machine

In this paper we will look into the problem of dynamic balancing of tasks in a het-erogenous parallel computing environment. The parallel programs are assumed to be executed in the Single Program Multiple Data (SPMD) style. The criteria for re-balancing the load are discussed; the eeect of data movement required in the load balancing is considered; and novel algorithms of dynamic load balancing...

متن کامل

Solving scheduling problems using parallel message-passing based constraint programming

We discuss some of the engineering challenges in implementing a constraint programming based scheduling engine to scale well on massively parallel computer hardware. In particular, we have been targeting our solvers to work in high performance computer environments such as the IBM BlueGene/P supercomputer. On such hardware parallelism is enabled at the software level using message passing, base...

متن کامل

Decentralized Service Orchestration by Continuous Message Passing

Decentralized service stands for distributing segments of workflow among various workflow engines, and workflow has set of activities responsible for invoking Web Services. Decentralized Orchestration holds an upper hand over Centralized Orchestration in producing optimal solutions in terms of scalability and network traffic by overcoming inefficient routing of messages. Although decentralized ...

متن کامل

Network scheduling and message-passing

Algorithms are operational building-blocks of a network. An important class of network algorithms deal with the scheduling of common resources among various entities such as packets or flows. In a generic setup, such algorithms operate under stringent hardware, time, power or energy constraints. Therefore, algorithms have to be extremely simple, lightweight in data-structure and distributed. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 2013

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/bxt140